Isomorphism testing for p-groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphism testing for circulant graphs

In this paper we focus on connected directed/undirected circulant graphs Cn(a, b). We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs Cn(a, b) and Cn(a , b) are isomorphic or not. The method is entirely elementary and co...

متن کامل

Isomorphism invariants for actions of sofic groups

For every countable group G, a family of isomorphism invariants for measurepreserving G-actions on probability spaces is defined. In the special case in which G is a countable sofic group, a special class of these invariants are computed exactly for Bernoulli systems over G. This leads to a complete classification of Bernoulli systems for many countable groups including all finitely generated l...

متن کامل

The Even Isomorphism Theorem for Coxeter Groups

Coxeter groups have presentations 〈S : (st)st∀s, t ∈ S〉 where for all s, t ∈ S, mst ∈ {1, 2, . . . ,∞}, mst = mts and mst = 1 if and only if s = t. A fundamental question in the theory of Coxeter groups is: Given two such “Coxeter” presentations, do they present the same group? There are two known ways to change a Coxeter presentation, generally referred to as twisting and simplex exchange. We ...

متن کامل

The isomorphism problem for Coxeter groups

By a recent result obtained by R. Howlett and the author considerable progress has been made towards a complete solution of the isomorphism problem for Coxeter groups. In this paper we give a survey on the isomorphism problem and explain in particular how the result mentioned above reduces it to its ‘reflection preserving’ version. Furthermore we desrcibe recent developments concerning the solu...

متن کامل

Testing isomorphism of modules

We present a new deterministic algorithm to test constructively for isomorphism between two given finite-dimensional modules of a finitely generated algebra. The algorithm uses only basic field operations; for arbitrary fields, this is not possible with the existing methodology. Furthermore, the number of field operations used by the algorithm is bounded by a polynomial in the length of the inp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1993

ISSN: 0747-7171

DOI: 10.1006/jsco.1993.1049